Trace-based Deductive Verification
نویسندگان
چکیده
Contracts specifying a procedure’s behavior in terms of pre- and postconditions are essential for scalable software verification, but cannot express any constraints on the events occurring during execution procedure. This necessitates to annotate code with intermediate assertions, preventing full specification abstraction. We propose logic over symbolic traces able specify recursive procedures mod- ular manner that refers specified programs only events. also provide deduction system based induction we prove be sound relative trace semantics. Our work generalizes contract-based trace-based deductive verification by extending notion state-based contracts contracts.
منابع مشابه
Deductive Verification
Clocked transition systems is a computational model for modelling real-time systems. Using this model we are able to use deductive verification for proving properties over our systems.
متن کاملDeductive Software Verification
Deductive Software Verification is characterized by three ingredients: first, target programs as well as the properties to be verified are represented as logical formulae that must be proven to be valid; second, validity is proven by deduction in a logic calculus; third, computer assistance is used for proof search and bookkeeping. In contrast to static analysis and model checking it is possibl...
متن کاملDeductive Verification of Reactive Systems
Fall 2007: Assignment No. 3 Due Date: 12.21.07 December 10, 2007 The solution to this assignment should be submitted as attachment to an e-mail message. The textual part should be prepared as a postscript, PDF, or Word document. All submitted smv and pf files should be submitted as separate files. You may group all relevant files into a single file, using ZIP or TAR. 1 Peterson(N) Algorithm In ...
متن کاملDeductive Verification of Modular Systems
EEective veriication methods, both deductive and algorith-mic, exist for the veriication of global system properties. In this paper, we introduce a formal framework for the modular description and verii-cation of parameterized fair transition systems. The framework allows us to apply existing global veriication methods, such as veriication rules and diagrams, in a modular setting. Transition sy...
متن کاملDeductive Verification of Legacy Code
Deductive verification is about proving that a piece of code conforms to a given requirement specification. For legacy code, this task is notoriously hard for three reasons: (1) writing specifications posthoc is much more difficult than producing code and its specification simultaneously, (2) verification does not scale as legacy code is often badly modularized, (3) legacy code may be written i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPiC series in computing
سال: 2023
ISSN: ['2398-7340']
DOI: https://doi.org/10.29007/vdfd